Square Roots of Real 3× 3 Matrices vs. Quartic Polynomials with Real Zeros
نویسنده
چکیده
There is an interesting analogy between the description of the real square roots of 3×3 matrices and the zeros of the (depressed) real quartic polynomials. This analogy, which in fact better explains the nature of the zeros of those polynomials, is unveiled through a natural use of the Cayley-Hamilton theorem.
منابع مشابه
On Classifications of Random Polynomials
Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...
متن کاملZeros of Ramanujan Polynomials
In this paper, we investigate the properties of Ramanujan polynomials, a family of reciprocal polynomials with real coefficients originating from Ramanujan’s work. We begin by finding their number of real zeros, establishing a bound on their sizes, and determining their limiting values. Next, we prove that all nonreal zeros of Ramanujan polynomials lie on the unit circle, and are asymptotically...
متن کاملDomain of attraction of normal law and zeros of random polynomials
Let$ P_{n}(x)= sum_{i=0}^{n} A_{i}x^{i}$ be a random algebraicpolynomial, where $A_{0},A_{1}, cdots $ is a sequence of independent random variables belong to the domain of attraction of the normal law. Thus $A_j$'s for $j=0,1cdots $ possesses the characteristic functions $exp {-frac{1}{2}t^{2}H_{j}(t)}$, where $H_j(t)$'s are complex slowlyvarying functions.Under the assumption that there exist ...
متن کاملComputing the square roots of matrices with central symmetry
For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were proposed by Björk and Hammarling [3], for square roots of general complex matrices, and by Higham [10], for real square roots of real matrices. In this paper we further consider (the computation of) the square roots of m...
متن کاملRoot Arrangements of Hyperbolic Polynomial-like Functions
A real polynomial P of degree n in one real variable is hyperbolic if its roots are all real. A real-valued function P is called a hyperbolic polynomial-like function (HPLF) of degree n if it has n real zeros and P (n) vanishes nowhere. Denote by x (i) k the roots of P , k = 1, . . . , n− i, i = 0, . . . , n− 1. Then in the absence of any equality of the form x (j) i = x (l) k (1) one has ∀i < ...
متن کامل